Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints

نویسندگان

  • Nima Roohi
  • Mahesh Viswanathan
چکیده

Initialized hybrid automata with linear differential inclusions and rectangular constraints are hybrid automata where the invariants, guards, resets, and initial values are given by rectangular constraints, the flows are described by linear differential inclusions of the form ax+ b C1 ẋ C2 cx + d (with C1,C2 ∈ {<,≤}), and a variable x is reset on mode change whenever the differential inclusion describing the dynamics for x changes. Such automata strictly subsume initialized rectangular automata. Our main result is that while the control state reachability problem for such automata is undecidable, the time-bounded reachability problem is decidable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What's Decidable About Hybrid Automata? y

Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many veri cation tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify a boundary between decidability and undecidability for the reachability problem of hybrid automata. On the po...

متن کامل

What ' s Decidable about Hybrid Automata ? 1

Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many veriication tasks for such programs can be expressed as reachability problems for hybrid au-tomata. By improving on previous decidability and un-decidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automat...

متن کامل

On Reachability for Hybrid Automata over Bounded Time

This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provide...

متن کامل

Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata

We define a new class of hybrid automata for which reachability is decidable—a proper superclass of the initialized rectangular hybrid automata—by taking parallel compositions of simple components. Attempting to generalize, we encounter timed automata with algebraic constants. We show that reachability is undecidable for these algebraic timed automata by simulating two-counter Minsky machines. ...

متن کامل

On The Reachability Problem for Recursive Hybrid Automata with One and Two Players

Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. In support of this theory, the list of undecidable problems recently shown decidable under time-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014